Descriptional Complexity of Formal Systems

Descriptional Complexity of Error/Edit Systems

On the Descriptional Complexity of Production Systems

In t h i s paper we f o r m a l i z e d i f f e r e n t methods f o r d e s c r i b i n g c o n t r o l knowledge in p roduc t i on systems by the concept of p r o d u c t i o n system schemes. In t h i s framework these methods are compared from the v iewpo in t o f d e s c r i p t i o n a l comp lex i t y g i v i n g us some i n s i g h t by which means problems can be descr ibed in an easy a...

On the Descriptional Complexity of Limited Propagating Lindenmayer Systems

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in ...

Descriptional Complexity of Error Detection

The neighbourhood of a language L consists of all strings that are within a given distance from a string of L. For example, additive distances or the prefixdistance are regularity preserving in the sense that the neighbourhood of a regular language is always regular. For error detection and error correction applications an important question is to determine the size of the minimal deterministic...

Parikh's Theorem and Descriptional Complexity

This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...